Long monotone paths on simple 4-polytopes
نویسندگان
چکیده
منابع مشابه
Long Monotone Paths on Simple 4-polytopes
TheMonotone Upper Bound Problem (Klee, 1965) asks if the numberM(d, n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d, n) = Mubt(d, n), the maximal number of vertices that a d-polytope with n facets can have according to the Upper Bound Theorem? We show that in dimension d = 4, the answer is “yes”, despite the...
متن کاملMonotone paths on polytopes
We investigate the vertex-connectivity of the graph of f -monotone paths on a d-polytope P with respect to a generic functional f . The third author has conjectured that this graph is always (d − 1)-connected. We resolve this conjecture positively for simple polytopes and show that the graph is 2-connected for any d-polytope with d ≥ 3. However, we disprove the conjecture in general by exhibiti...
متن کاملLong Monotone Paths in Abstract Polytopes
Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of ...
متن کاملMonotone paths in planar convex subdivisions and polytopes∗
Consider a connected subdivision of the plane into n convex faces where every vertex is incident to at most ∆ edges. Then, starting from every vertex there is a path with at least Ω(log∆ n) edges that is monotone in some direction. This bound is the best possible. Consider now a connected subdivision of the plane into n convex faces where exactly k faces are unbounded. Then, there is a path wit...
متن کاملComputing Disjoint Paths on Polytopes
The Holt-Klee Condition states that there exist at least d vertex-disjoint strictly monotone paths from the source to the sink of a polytopal digraph consisting of the set of vertices and arcs of a polytope P directed by a linear objective function in general position. Studying these paths has the potential to provide new insight into a long standing problem, that of designing a polynomial-time...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Israel Journal of Mathematics
سال: 2005
ISSN: 0021-2172,1565-8511
DOI: 10.1007/bf02762386